Tight risk bound for high dimensional time series completion
نویسندگان
چکیده
Initially designed for independent datas, low-rank matrix completion was successfully applied in many domains to the reconstruction of partially observed high-dimensional time series. However, there is a lack theory support application these methods dependent datas. In this paper, we propose general model multivariate, We show that least-square method with rank penalty leads error same order as Moreover, when series has some additional properties such periodicity or smoothness, rate can actually be faster than case.
منابع مشابه
A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملModeling High Dimensional Time Series
This paper investigates the effectiveness of the recently proposed Gaussian Process Dynamical Model (GPDM) on high dimensional chaotic time series. The GPDM takes a Bayesian approach to modeling high-dimensional time series data, using the Gaussian process Latent Variable model (GPLVM) for nonlinear dimensionality reduction combined with a nonlinear dynamical model in latent space. The GPDM is ...
متن کاملa new branch-and-bound for the problem of mean completion time for the single machine with release time
preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2022
ISSN: ['1935-7524']
DOI: https://doi.org/10.1214/22-ejs2015